Similarity-based local community detection for bipartite networks
نویسندگان
چکیده
منابع مشابه
Modularity and community detection in bipartite networks.
The modularity of a network quantifies the extent, relative to a null model network, to which vertices cluster into community groups. We define a null model appropriate for bipartite networks, and use it to define a bipartite modularity. The bipartite modularity is presented in terms of a modularity matrix B; some key properties of the eigenspectrum of B are identified and used to describe an a...
متن کاملImproved community detection in weighted bipartite networks
Real-world complex networks are composed of non-random quantitative interactions. Identifying communities of nodes that tend to interact more with each other than the network as a whole is a key research focus across multiple disciplines, yet many community detection algorithms only use information about the presence or absence of interactions between nodes. Weighted modularity is a potential m...
متن کاملHierarchical Community Detection Algorithm based on Local Similarity
Although community, one of the general characteristics of complex networks, has obvious hierarchical structure, in-depth research on its application in the current community detection algorithms is limited. In this paper we present a novel hierarchical community detection algorithm which starts from the node similarity calculation based on local adjacency in networks. Then we find the initial c...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملCommunity detection for networks with unipartite and bipartite structure
Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite network consists of one set of nodes and a bipartite network consists of two nonoverlapping sets of nodes with only links joining the nodes in different sets. How...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2018
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1805559c